0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.13/0.34	% Computer : n028.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1920
0.13/0.34	% WCLimit    : 240
0.13/0.34	% DateTime   : Wed Jul 30 02:20:49 EDT 2025
0.13/0.34	% CPUTime    : 
0.20/0.49	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p
0.20/0.51	# Version: 3.0.0-ho
0.20/0.51	# Preprocessing class: HSSSSMSSSSMCHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.51	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.20/0.51	# Starting new_bool_3 with 240s (1) cores
0.20/0.51	# Starting new_bool_1 with 240s (1) cores
0.20/0.51	# new_bool_3 with pid 23604 completed with status 0
0.20/0.51	# Result found by new_bool_3
0.20/0.51	# Preprocessing class: HSSSSMSSSSMCHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.51	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.20/0.51	# Starting new_bool_3 with 240s (1) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.20/0.51	# Search class: HHUNF-FFSS00-SHHFFSBC
0.20/0.51	# partial match(3): HGUNF-FFSF00-SHHFFSBN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.51	# Starting ho_unfolding_3 with 108s (1) cores
0.20/0.51	# ho_unfolding_3 with pid 23607 completed with status 0
0.20/0.51	# Result found by ho_unfolding_3
0.20/0.51	# Preprocessing class: HSSSSMSSSSMCHHA.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.51	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.20/0.51	# Starting new_bool_3 with 240s (1) cores
0.20/0.51	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.20/0.51	# Search class: HHUNF-FFSS00-SHHFFSBC
0.20/0.51	# partial match(3): HGUNF-FFSF00-SHHFFSBN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.51	# Starting ho_unfolding_3 with 108s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_23, type, epso: ($o > $o) > $o).
0.20/0.51	thf(decl_24, type, epsoo: (($o > $o) > $o) > $o > $o).
0.20/0.51	thf(decl_25, type, q: ($o > $o) > $o).
0.20/0.51	thf(decl_26, type, esk1_0: $o).
0.20/0.51	thf(decl_27, type, esk2_0: $o).
0.20/0.51	thf(decl_28, type, esk3_0: $o).
0.20/0.51	thf(c, conjecture, (q @ (epsoo @ epso)), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', c)).
0.20/0.51	thf(qkf, axiom, (q @ (^[X2:$o]:(~($true)))), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', qkf)).
0.20/0.51	thf(qkt, axiom, (q @ (^[X2:$o]:(($true)))), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', qkt)).
0.20/0.51	thf(qid, axiom, (q @ (^[X2:$o]:((X2)))), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', qid)).
0.20/0.51	thf(choiceaxo, axiom, ![X1:$o > $o]:(((X1 @ ((epso @ X1)))<=?[X2:$o]:((X1 @ ((X2)))))), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', choiceaxo)).
0.20/0.51	thf(choiceaxoo, axiom, ![X3:($o > $o) > $o]:((?[X4:$o > $o]:((X3 @ X4))=>(X3 @ (epsoo @ X3)))), file('/export/starexec/sandbox/tmp/tmp.Vi83meUa9l/E---3.1_23515.p', choiceaxoo)).
0.20/0.51	thf(c_0_6, negated_conjecture, ~(q @ (epsoo @ epso)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c])])).
0.20/0.51	thf(c_0_7, plain, (q @ (^[Z0/* 7 */:$o]:(~($true)))), inference(fof_simplification,[status(thm)],[qkf])).
0.20/0.51	thf(c_0_8, negated_conjecture, ~(q @ (epsoo @ epso)), inference(fof_nnf,[status(thm)],[c_0_6])).
0.20/0.51	thf(c_0_9, plain, (q @ (^[Z0/* 1 */:$o]:($true))), inference(fof_simplification,[status(thm)],[qkt])).
0.20/0.51	thf(c_0_10, plain, (q @ (^[Z0/* 7 */:$o]:(~(($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.51	thf(c_0_11, plain, (q @ (^[Z0/* 0 */:$o]:(Z0))), inference(fof_simplification,[status(thm)],[qid])).
0.20/0.51	thf(c_0_12, negated_conjecture, ~((q @ (epsoo @ epso))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.51	thf(c_0_13, plain, (q @ (^[Z0/* 3 */:$o]:(($true)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.51	thf(c_0_14, plain, (q @ (^[Z0/* 4 */:$o]:(~($true)))), inference(cn,[status(thm)],[c_0_10])).
0.20/0.51	thf(c_0_15, plain, (q @ (^[Z0/* 3 */:$o]:((Z0)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.51	thf(c_0_16, plain, ((^[Z0/* 3 */:$o]:(($true)))!=(epsoo @ epso)), inference(ext_sup,[status(thm)],[c_0_12, c_0_13])).
0.20/0.51	thf(c_0_17, plain, ((^[Z0/* 4 */:$o]:(~($true)))!=(epsoo @ epso)), inference(ext_sup,[status(thm)],[c_0_12, c_0_14])).
0.20/0.51	thf(c_0_18, plain, ((^[Z0/* 3 */:$o]:((Z0)))!=(epsoo @ epso)), inference(ext_sup,[status(thm)],[c_0_12, c_0_15])).
0.20/0.51	thf(c_0_19, plain, ![X1:$o > $o]:((?[X2:$o]:((X1 @ ((X2))))=>(X1 @ ((epso @ X1))))), inference(fof_simplification,[status(thm)],[choiceaxo])).
0.20/0.51	thf(c_0_20, plain, ~((epsoo @ epso @ ((esk1_0)))), inference(neg_ext,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_21, plain, (epsoo @ epso @ ((esk3_0))), inference(neg_ext,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_22, plain, ((epsoo @ epso @ ((esk2_0)))<~>(esk2_0)), inference(neg_ext,[status(thm)],[c_0_18])).
0.20/0.51	thf(c_0_23, plain, ![X11:$o > $o, X12:$o]:((~(X11 @ ((X12)))|(X11 @ ((epso @ X11))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])).
0.20/0.51	thf(c_0_24, plain, ((esk1_0)<~>(esk3_0)), inference(ext_sup,[status(thm)],[c_0_20, c_0_21])).
0.20/0.51	thf(c_0_25, plain, ((epsoo @ epso @ (~($true)))|(esk2_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_22])])).
0.20/0.51	thf(c_0_26, plain, (~((epsoo @ epso @ (($true))))|~((esk2_0))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_22])])).
0.20/0.51	thf(c_0_27, plain, ![X1:$o > $o, X2:$o]:(((X1 @ ((epso @ X1)))|~((X1 @ ((X2)))))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.20/0.51	thf(c_0_28, plain, (~((esk1_0))|~((esk3_0))), inference(dynamic_cnf,[status(thm)],[c_0_24])).
0.20/0.51	thf(c_0_29, plain, ((esk2_0)|(esk1_0)), inference(ext_sup,[status(thm)],[c_0_20, c_0_25])).
0.20/0.51	thf(c_0_30, plain, (~((esk3_0))|~((esk2_0))), inference(ext_sup,[status(thm)],[c_0_26, c_0_21])).
0.20/0.51	thf(c_0_31, plain, ![X9:($o > $o) > $o, X10:$o > $o]:((~(X9 @ X10)|(X9 @ (epsoo @ X9)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxoo])])])])).
0.20/0.51	thf(c_0_32, plain, ![X2:$o]:(((epso @ (^[Z0/* 3 */:$o]:((((Z0))=((X2))))))<=>(X2))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_27])).
0.20/0.51	thf(c_0_33, plain, ~((esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
0.20/0.51	thf(c_0_34, plain, ![X3:($o > $o) > $o, X1:$o > $o]:(((X3 @ (epsoo @ X3))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.20/0.51	thf(c_0_35, plain, (epso @ (^[Z0/* 3 */:$o]:((Z0)))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_32])])).
0.20/0.51	thf(c_0_36, plain, (esk1_0), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_24]), c_0_33])).
0.20/0.51	thf(c_0_37, plain, (epsoo @ epso @ ((epso @ (epsoo @ epso)))), inference(spm,[status(thm)],[c_0_27, c_0_21])).
0.20/0.51	thf(c_0_38, plain, (epso @ (epsoo @ epso)), inference(spm,[status(thm)],[c_0_34, c_0_35])).
0.20/0.51	thf(c_0_39, plain, ~((epsoo @ epso @ (($true)))), inference(rw,[status(thm)],[c_0_20, c_0_36])).
0.20/0.51	thf(c_0_40, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_38]), c_0_39]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 9
0.20/0.51	# Removed by relevancy pruning/SinE    : 3
0.20/0.51	# Initial clauses                      : 6
0.20/0.51	# Removed in clause preprocessing      : 0
0.20/0.51	# Initial clauses in saturation        : 6
0.20/0.51	# Processed clauses                    : 48
0.20/0.51	# ...of these trivial                  : 3
0.20/0.51	# ...subsumed                          : 5
0.20/0.51	# ...remaining for further processing  : 40
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 6
0.20/0.51	# Backward-rewritten                   : 2
0.20/0.51	# Generated clauses                    : 49
0.20/0.51	# ...of the previous two non-redundant : 41
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 1
0.20/0.51	# Paramodulations                      : 13
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 4
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Disequality decompositions           : 0
0.20/0.51	# Total rewrite steps                  : 7
0.20/0.51	# ...of those cached                   : 3
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 22
0.20/0.51	#    Positive orientable unit clauses  : 8
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 8
0.20/0.51	#    Non-unit-clauses                  : 6
0.20/0.51	# Current number of unprocessed clauses: 5
0.20/0.51	# ...number of literals in the above   : 8
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 18
0.20/0.51	# Clause-clause subsumption calls (NU) : 20
0.20/0.51	# Rec. Clause-clause subsumption calls : 20
0.20/0.51	# Non-unit clause-clause subsumptions  : 6
0.20/0.51	# Unit Clause-clause subsumption calls : 30
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 8
0.20/0.51	# BW rewrite match successes           : 2
0.20/0.51	# Condensation attempts                : 48
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 1582
0.20/0.51	# Search garbage collected termcells   : 75
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.007 s
0.20/0.51	# System time              : 0.001 s
0.20/0.51	# Total time               : 0.008 s
0.20/0.51	# Maximum resident set size: 1860 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.008 s
0.20/0.51	# System time              : 0.003 s
0.20/0.51	# Total time               : 0.011 s
0.20/0.51	# Maximum resident set size: 1732 pages
0.20/0.51	% E exiting
0.20/0.51	% E exiting
0.20/0.51	EOF